منابع مشابه
On k-Enclosing Objects in a Coloured Point Set
We introduce the exact coloured k-enclosing object problem: given a set P of n points in R, each of which has an associated colour in {1, . . . , t}, and a vector c = (c1, . . . , ct), where ci ∈ Z for each 1 ≤ i ≤ t, find a region that contains exactly ci points of P of colour i for each i. We examine the problems of finding exact coloured k-enclosing axis-aligned rectangles, squares, discs, a...
متن کاملk-colored Point-set Embeddability of Outerplanar Graphs
This paper addresses the problem of designing drawing algorithms that receive as input a planar graph G, a partitioning of the vertices of G into k different semantic categories V0, · · · , Vk−1, and k disjoint sets S0, · · · , Sk−1 of points in the plane with |Vi| = |Si| (i ∈ {0, · · · , k − 1}). The desired output is a planar drawing such that the vertices of Vi are mapped onto the points of ...
متن کاملA fixed point result for a new class of set-valued contractions
In this paper, we introduce a new class of set-valued contractions and obtain a xed point theoremfor such mappings in complete metric spaces. Our main result generalizes and improves many well-known xed point theorems in the literature.
متن کاملParallel frequent set counting
Computing the frequent subsets of large multi-attribute data is both computationand data-intensive. The standard parallel algorithms require multiple passes through the data. The cost of data access may easily outweigh any performance gained by parallelizing the computational part. We address three opportunities for performance improvement: using an approximate algorithm that requires only a si...
متن کاملCounting the Interior of a Point Configuration
We prove a formula conjectured by Ahrens, Gordon, and McMa-hon for the number of interior points for a point connguration in R d. Our method is to show that the formula can be interpreted as a sum of Euler characteristics of certain complexes associated with the point connguration, and then compute the homology of these complexes. This method extends to other examples of convex geometries. We s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1990
ISSN: 0097-3165
DOI: 10.1016/0097-3165(90)90055-2